Optimizing RDF Chain Queries using Genetic Algorithms

نویسندگان

  • Alexander Hogenboom
  • Viorel Milea
  • Flavius Frasincar
  • Uzay Kaymak
چکیده

In an Electronic Commerce environment, Semantic Web technologies are promising enablers for large-scale knowledge-based systems, as they facilitate machine-interpretability of data through effective data representation. Fast query engines are required for efficient real-time querying of large amounts of data, usually represented using the Resource Description Framework (RDF). An RDF model is a collection of RDF facts declared as a collection of triples, each of which consists of a subject, a predicate, and an object. These triples can be visualized using an RDF graph, which is a node and directed-arc diagram, in which each triple is represented as a node-arc-node link. RDF sources can be queried using SPARQL. The execution time of a query depends on the order in which parts of the query paths are executed. The query optimization challenge addressed here is to determine the right join order, hereby optimizing the overall response time.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Genetic Algorithms for RDF Chain Query Optimization

The application of Semantic Web technologies in an Electronic Commerce environment implies a need for good support tools. Fast query engines are required for efficient real-time querying of large amounts of data, usually represented using RDF. We focus on optimizing a special class of SPARQL queries: RDF chain queries. We devise a genetic algorithm, RCQ-GA, that determines the order in which jo...

متن کامل

Relational Databases Query Optimization using Hybrid Evolutionary Algorithm

Optimizing the database queries is one of hard research problems. Exhaustive search techniques like dynamic programming is suitable for queries with a few relations, but by increasing the number of relations in query, much use of memory and processing is needed, and the use of these methods is not suitable, so we have to use random and evolutionary methods. The use of evolutionary methods, beca...

متن کامل

Optimizing Reformulation-based Query Answering in RDF

Reformulation-based query answering is a query processing technique aiming at answering queries under constraints. It consists of reformulating the query based on the constraints, so that evaluating the reformulated query directly against the data (i.e., without considering any more the constraints) produces the correct answer set. In this paper, we consider optimizing reformulation-based query...

متن کامل

Ant colony optimization for RDF chain queries for decision support

Semantic Web technologies can be utilized in expert systems for decision support, allowing a user to explore in the decision making process numerous interconnected sources of data, commonly represented by means of the Resource Description Framework (RDF). In order to disclose the ever-growing amount of widely distributed RDF data to demanding users in real-time environments, fast RDF query engi...

متن کامل

Optimizing Aggregate SPARQL Queries Using Materialized RDF Views

During recent years, more and more data has been published as native RDF datasets. In this setup, both the size of the datasets and the need to process aggregate queries represent challenges for standard SPARQL query processing techniques. To overcome these limitations, materialized views can be created and used as a source of precomputed partial results during query processing. However, materi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010